A detailed argument is provided for the thesis that Dedekind was a logicist about arithmetic. The rules of inference employed in Dedekind's construction of arithmetic are, by his lights, all purely logical in character, and the definitions are all explicit; even the definition of the natural numbers as the abstract type of simply infinite systems can be seen to be explicit. The primitive concepts of the construction are logical in their being intrinsically tied to the functioning of the understanding.

A detailed argument is provided for the thesis that Dedekind was a logicist about arithmetic. The rules of inference employed in Dedekind's construction of arithmetic are, by his lights, all purely logical in character, and the definitions are all explicit; even the definition of the natural numbers as the abstract type of simply infinite systems can be seen to be explicit. The primitive concepts of the construction are logical in their being intrinsically tied to the functioning of the understanding.

Using infinite time Turing machines we define two successive extensions of Kleene’s ${\mathcal{O}}$ and characterize both their height and their complexity. Specifically, we first prove that the one extension—which we will call ${\mathcal{O}^{+}}$ —has height equal to the supremum of the writable ordinals, and that the other extension—which we will call ${\mathcal{O}}^{++}$ —has height equal to the supremum of the eventually writable ordinals. Next we prove that ${\mathcal{O}^+}$ is Turing computably isomorphic to the halting problem of infinite time Turing computability, (...) and that ${\mathcal{O}^{++}}$ is Turing computably isomorphic to the halting problem of eventual computability. (shrink)